Notes on random reals
نویسندگان
چکیده
The theory of random real numbers is exceedingly well-developed, and fascinating from many points of view. It is also quite challenging mathematically. The present notes are intended as no more than a gateway to the larger theory. They review just the most elementary part of the theory (bearing on Kolmogorovand Martin-Löf-randomness). We hope that the simple arguments presented here will encourage the enterprising student to examine richer treatments of the subject available elsewhere, notably, in Downey and Hirschfeldt (2010).1 Comments and corrections to the notes are, of course, welcome.
منابع مشابه
Relative randomness and real closed fields
We show that for any real number, the class of real numbers less random than it, in the sense of rK-reducibility, forms a countable real closed subfield of the real ordered field. This generalizes the well-known fact that the computable reals form a real closed field. With the same technique we show that the class of differences of computably enumerable reals (d.c.e. reals) and the class of com...
متن کاملLecture Notes on Randomness for Continuous Measures
Most studies on algorithmic randomness focus on reals random with respect to the uniform distribution, i.e. the (1/2, 1/2)-Bernoulli measure, which is measure theoretically isomorphic to Lebesgue measure on the unit interval. The theory of uniform randomness, with all its ramifications (e.g. computable or Schnorr randomness) has been well studied over the past decades and has led to an impressi...
متن کاملLowness Properties of Reals and Hyper-Immunity
Ambos-Spies and Kučera [1, Problem 4.5] asked if there is a non-computable set A which is low for the computably random reals. We show that no such A is of hyper-immune degree. Thus, each g ≤T A is dominated by a computable function. Ambos-Spies and Kučera [1, Problem 4.8] also asked if every S-low set is S0-low. We give a partial solution to this problem, showing that no S-low set is of hyper-...
متن کاملSchnorr trivial reals: a construction
A real is Martin-Löf (Schnorr) random if it does not belong to any effectively presented null Σ 0 1 (recursive) class of reals. Although these randomness notions are very closely related, the set of Turing degrees containing reals that are K-trivial has very different properties from the set of Turing degrees that are Schnorr trivial. Nies proved in [12] that all K-trivial reals are low. In thi...
متن کاملSubclasses of the Weakly Random Reals
The weakly random reals contain not only the Schnorr random reals as a subclass but also the weakly 1-generic reals and therefore the n-generic reals for every n. While the class of Schnorr random reals does not overlap with any of these classes of generic reals, their degrees may. In this paper, we describe the extent to which this is possible for the Turing, weak truth-table, and truth-table ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1209.2875 شماره
صفحات -
تاریخ انتشار 2011